Technical Note—An Integer Maximization Problem
نویسندگان
چکیده
منابع مشابه
On Integer Multiflow Maximization
Generalizing the two-commodity ow theorem of Rothschild and Whinston and the multiiow theorem of Lovv asz and Cherkasskij, Karzanov and Lomonosov proved a min-max theorem on maximum multiiows in the seventies. Their original proof is quite long and technical and relies on earlier investigations on metrics. The main purpose of the present paper is to provide a relatively simple proof of this the...
متن کاملInteger Convex Maximization
We show that an important broad class of integer programming problems in variable dimension with convex objective functions is solvable in polynomial time, and discuss various applications including to multiway transportation problems, packing problems and partitioning problems.
متن کاملConvex integer maximization via Graver bases
We present a new algebraic algorithmic scheme to solve convex integer maximization problems of the following form, where c is a convex function on R and w1x, . . . , wdx are linear forms on R, max {c(w1x, . . . , wdx) : Ax = b, x ∈ N} . This method works for arbitrary input data A, b, d, w1, . . . , wd, c. Moreover, for fixed d and several important classes of programs in variable dimension, we...
متن کاملOn test sets for nonlinear integer maximization
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results that apply to integer optimization problems with nonlinear objective functions.
متن کاملTechnical Report Integer Programming 1 Integer Programming 4
1 To appear as a chapter of the Handbook of Algorithms edited by M. Abstract Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1971
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.19.2.548